Automated Theorem Proving: Underlying Theory, Overarching Concepts, and Human Factor Issues
نویسنده
چکیده
In this memo, we discuss the topic of automated theorem proving. This note is intended to serve as an introduction for someone interested in the topic but who doesn’t have extensive background in formal proof systems. The topics covered in this memo are kept at a somewhat conceptual level and pointers are provided to appropriate references for more in-depth treatment of specific topics. In the first section, we present an overview of the theory involved in automated theorem proving, including core definitions, theoretical limitations, and practical implications. In the second section, we present the general concepts that are present in all theorem provers and list a few popular theorem proving systems as surveyed through the literature. Finally, in the third section, we give a list of the human factor issues that are inherent in the use of automated theorem provers and how those issues affect the practicality of using automated proof systems.
منابع مشابه
Automating Leibniz's Theory of Concepts
Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics...
متن کاملIsar - A Generic Interpretative Approach to Readable Formal Proof Documents
We present a generic approach to readable formal proof documents, called Intelligible semi-automated reasoning (Isar). It addresses the major problem of existing interactive theorem proving systems that there is no appropriate notion of proof available that is suitable for human communication, or even just maintenance. Isar’s main aspect is its formal language for natural deduction proofs, whic...
متن کاملRepresenting Herbrand Models by Grammars and Deciding Equivalence Eeciently
Finding computationally valuable representations of models of predicate logic formulas is an important subtask in many elds related to automated theorem proving, e.g. automated model building or semantic resolution. In this article we investigate the use of context-free languages for representing single Herbrand models, emphasizing algorith-mic issues like the equivalence test (which we solve b...
متن کاملExternal Sources of Axioms in Automated Theorem Proving
In recent years there has been a growing demand for Automated Theorem Proving (ATP) in large theories, which often have more axioms than can be handled effectively as normal internal axioms. This work addresses the issues of accessing external sources of axioms from a first-order logic ATP system, and presents an implemented ATP system that retrieves external axioms asynchronously, on demand.
متن کاملA Unified Approach to Theory Reasoning
Theory reasoning is a kind of two-level reasoning in automated theorem proving, where the knowledge of a given domain or theory is separated and treated by special purpose inference rules. We define a classification for the various approaches for theory reasoning which is based on the syntactic concepts of literal level — term level — variable level. The main part is a review of theory extensio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007